An Algorithm for Constructing All Families of Codes of Arbitrary Requirement in an OCDMA System
نویسندگان
چکیده
—A novel code construction algorithm is presented to find all the possible code families for code reconfiguration in an OCDMA system. The algorithm is developed through searching all the complete subgraphs of a constructed graph. The proposed algorithm is flexible and practical for constructing optical orthogonal codes (OOCs) of arbitrary requirement. Simulation results show that one should choose an appropriate code length in order to obtain sufficient number of code families for code reconfiguration with reasonable cost.
منابع مشابه
Emerging Optical CDMA Techniques and Applications
In this paper we present an in-depth review on the trends and the directions taken by the researchers worldwide in Optical Code Division Multiple Access (OCDMA) systems. We highlight those trends and features that are believed to be essential to the successful introduction of various OCDMA techniques in communication systems and data networks in near future. In particular we begin by giving a c...
متن کاملAn Efficient Numerical Algorithm For Solving Linear Differential Equations of Arbitrary Order And Coefficients
Referring to one of the recent works of the authors, presented in~cite{differentialbpf}, for numerical solution of linear differential equations, an alternative scheme is proposed in this article to considerably improve the accuracy and efficiency. For this purpose, triangular functions as a set of orthogonal functions are used. By using a special representation of the vector forms of triangula...
متن کاملPerformance Comparison between Modified Prime Sequence Codes and Superimposed Optical Cyclic Orthogonal Codes for OCDMA System at 5Gbps Bit Rate
In this paper the performance of two coding techniques named Modified Prime Sequence Codes (MPSC) and Superimposed Cyclic Optical Orthogonal Codes (SCOOC) is compared for Optical Code Division Multiple Access (OCDMA) system. A realistic simulation model of OCDMA system is designed for analyzing the performance of these codes. The performance analysis in terms of bit error rate, quality factor i...
متن کاملDesign and performance analysis of code families for multi-dimensional optical CDMA
A code design algorithm for application in Multi-Dimensional Optical Code Division Multiple Access (MD-OCDMA) for asynchronous optical fibre communication is proposed. Two-dimensional (2-D) wavelength-time or space-time OCDMA and three-dimensional (3-D) space-wavelength-time OCDMA are subsets of MD-OCDMA. Some applications and the performance analysis of the algorithm in 2-D multipulse per row ...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0601088 شماره
صفحات -
تاریخ انتشار 2006